Analyzing Logic Programs Using \ Prop " -
نویسنده
چکیده
This paper illustrates the role of a class of \prop"-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding \prop"-ositional logic programs which approximate the original programs and have nite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain Prop. The main contribution is in the ease in which a highly eecient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's success patterns. Goal dependent information such as call patterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and eecient way.
منابع مشابه
Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand
This paper illustrates the role of a class of \prop"-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding \prop"-ositional logic programs which approximate the original programs and have nite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretati...
متن کاملDeriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop
This paper illustrates the application of abstract compilation using multiple incarnations of the domain Prop in deriving type dependencies for logic programs. We illustrate how dependencies can be derived in the presence of both monomorphic and polymorphic type information. Type dependencies generalize the recently proposed notion of directional types as well as the more common notion of groun...
متن کاملPolymorphic Type Analysis in Logic Programs by Abstract Interpretation1
domains and their associated abstract operators. Some examples are to be found in [6, 22, 24, 27, 28]. Most type analysis systems infer descriptive types. A descriptive type is a description of a set of terms by an expression in a type language. Different type analysis systems may use different type languages. Most of them use regular types or deterministic regular types [16] in one form or ano...
متن کاملUsing Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated to normal programs, which can be utilized to compute answer sets. The basic idea is to detect special subgraphs of those graphs corresponding to structural properties of normal programs and transform them into simpler ...
متن کاملGoal Dependent vs. Goal Independent Analysis of Logic Programs
Abs t r ac t . Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach. However, while the literature is rich in descriptions of top-down analysers and their application, practical experience with bottom-up analysis is still in a preliminary stage. Moreover, the practical use of existing top-down frameworks for goal independent analysis has not...
متن کامل